A characterization for sparse ε-regular pairs
نویسندگان
چکیده
We are interested in (ε)-regular bipartite graphs which are the central objects in the regularity lemma of Szemerédi for sparse graphs. A bipartite graph G = (A]B,E) with density p = |E|/(|A||B|) is (ε)-regular if for all sets A′ ⊆ A and B′ ⊆ B of size |A′| ≥ ε|A| and |B ′| ≥ ε|B|, it holds that |eG(A, B′)/(|A′||B′|) − p| ≤ εp. In this paper we prove a characterization for (ε)-regularity. That is, we give a set of properties that hold for each (ε)-regular graph, and conversely if the properties of this set hold for a bipartite graph, then the graph is f(ε)-regular for some appropriate function f with f(ε) → 0 as ε → 0. The properties of this set concern degrees of vertices and common degrees of vertices with sets of size Θ(1/p) where p is the density of the graph in question.
منابع مشابه
Matrix-Free Proof of a Regularity Characterization
The central concept in Szemerédi’s powerful regularity lemma is the so-called ε-regular pair. A useful statement of Alon et al. essentially equates the notion of an ε-regular pair with degree uniformity of vertices and pairs of vertices. The known proof of this characterization uses a clever matrix argument. This paper gives a simple proof of the characterization without appealing to the matrix...
متن کاملCliques in Regular Graphs and the Core-Periphery Problem in Social Networks
The existence of a densely knit core surrounded by a loosely connected periphery is a common macro-structural feature of social networks. Formally, the CorePeriphery problem is to partition the nodes of an undirected graph G = (V,E) such that a subset X ⊂ V , the core, induces a dense subgraph, and its complement V \X, the periphery, induces a sparse subgraph. Split graphs represent the ideal c...
متن کاملSmall subsets inherit sparse ε-regularity
In this paper we investigate the behaviour of subgraphs of sparse ε-regular bipartite graphs G = (V1 ∪ V2, E) with vanishing density d that are induced by small subsets of vertices. In particular, we show that, with overwhelming probability, a random set S ⊆ V1 of size s 1/d contains a subset S′ with |S′| ≥ (1 − ε′)|S| that induces together with V2 an ε′-regular bipartite graph of density (1 ± ...
متن کاملFinding paths in sparse random graphs requires many queries
We discuss a new algorithmic type of problem in random graphs studying the minimum number of queries one has to ask about adjacency between pairs of vertices of a random graph G ∼ G(n, p) in order to find a subgraph which possesses some target property with high probability. In this paper we focus on finding long paths in G ∼ G(n, p) when p = 1+ε n for some fixed constant ε > 0. This random gra...
متن کاملApproximation of Two-variate Functions: Singular Value Decomposition versus Regular Sparse Grids
We compare the cost complexities of two approximation schemes for functions f ∈ H(Ω1×Ω2) which live on the product domain Ω1 × Ω2 of general domains Ω1 ⊂ R1 and Ω2 ⊂ R2 , namely the singular value / Karhunen-Lòeve decomposition and the regular sparse grid representation. Here we assume that suitable finite element methods with associated fixed order r of accuracy are given on the domains Ω1 and...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007